Vasco M. Tanner
نویسندگان
چکیده
منابع مشابه
The VASCO R - tree JAVA TM Applet
Features of the VASCO R-tree JAVATM applet are described to support its demonstration. This includes an explanation of the different R-tree node splitting methods that are implemented in VASCO and of the functionality of the control panel of the applet. The applet enables users to visualize the different variants of the R-tree as well as observe their behavior for finding the nearest neighbors ...
متن کاملLocal-Optimality Characterizations in Decoding Tanner Codes
Recent developments in decoding Tanner codes with maximum-likelihood certificates are based on a sufficient condition called local-optimality. We define hierarchies of locally optimal codewords with respect to two parameters. One parameter is related to the distance of the local codes in Tanner codes. The second parameter is related to the finite number of iterations used in iterative decoding....
متن کاملBD-IDHV. Una Bibloteca Digital de Derecho Histórico Vasco
BD-IDHV es un proyecto para la construcción de una Biblioteca Digital especializada en materia de Derecho Histórico y Autonómico para el Instituto de Derecho Histórico de Vasconia (IDHV). El IDHV es una institución dedicada al estudio del Derecho Vasco. Actualmente, posee la única Biblioteca especializada en historiografía jurídica vasca. Un problema importante que presenta esta Biblioteca es q...
متن کاملRISC vs . CISC – The Post - RISC Vasco Nuno
This communication analyses the birth of RISC and CISC architectures and their evolution over the past 20 years. It gives an overview of the competition between both to win the performance race, by adding new features, mainly from the opposite side and in the end converging into what is now known as Post-RISC era. The communication complements this issue by taking a brief look into novel VLIW p...
متن کاملWhich codes have cycle-free Tanner graphs?
If a linear block code C of length n has a Tanner graph without cycles, then maximum-likelihood soft-decision decoding of C can be achieved in time O(n). However, we show that cycle-free Tanner graphs cannot support good codes. Specifically, let C be an (n, k, d) linear code of rate R = k/n that can be represented by a Tanner graph without cycles. We prove that if R ≥ 0.5 then d ≤ 2, while if R...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Great Basin naturalist.
سال: 1970
ISSN: 0017-3614
DOI: 10.5962/bhl.part.5894